# ！/home/yang/PythonProjects python
# -*- coding: utf-8 -*-
# author:yang  time:19-7-25 上午9:48


from math import sqrt


def is_prime(n):
    if n == 1:
        return
    for i in range(2, int(sqrt(n))+1):
        if n % i == 0:
            return
    return n


def main():
    prime = []
    for i in range(1, 101):
        prime.append(is_prime(i))
    # prime_num = []
    # for i in prime:
    #     if i is not None:
    #         prime_num.append(i)

    # print(prime_num)

    for i in range(0, len(prime)):
        if None in prime:
            b = prime.index(None)
            prime.pop(b)
        else:
            break

    print(prime)


if __name__ == '__main__':
    main()
